Relative Neighborhood Graphs and Their Relatives
نویسندگان
چکیده
This is a survey of results on neighborhood graphs The paper discusses properties bounds on the size algorithms and variants of the neighborhood graphs Numerous applications including computational morphology spatial analysis pattern classi cation and data bases for computer vision are described A rich bibliography of the subject concludes the paper keywords computational geometry computational morphology geometric graphs neigh borhood graphs spatial analysis Department of Computer Science University of Kentucky Lexington KY School of Computer Science McGill University University Street Montreal Quebec Canada H A A
منابع مشابه
Spectra of some new extended corona
For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملSolving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs
Chang, MS., C.Y. Tang and R.C.T. Lee, Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs, Discrete Applied Mathematics 39 (1992) 1-12. In this paper, we discuss the Euclidean bottleneck biconnected edge subgraph problem. We shall first define a k-relative neighborhood graph which is similar to the relative neighborhood graph first proposed by To...
متن کاملSpectra of Some New Graph Operations and Some New Class of Integral Graphs
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992